In some curved spaces, one can solve NP-hard problems in polynomial time

In Some Curved Spaces, One Can Solve NP-Hard Problems in Polynomial Time

In the late 1970s and the early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for solving NP-hard problems in polynomial time. In this paper, we describe one such scheme in which we use parallel computation in curved spaces.

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

How to solve NP-hard graph problems on lique-width bounded graphs in polynomial time

LSTM can Solve Hard Long Time Lag Problems

Standard recurrent nets cannot deal with long minimal time lags between relevant signals. Several recent NIPS papers propose alternative methods. We rst show: problems used to promote various previous algorithms can be solved more quickly by random weight guessing than by the proposed algorithms. We then use LSTM, our own recent algorithm, to solve a hard problem that can neither be quickly sol...

Approaching P=NP: Can Soap Bubbles Solve The Steiner Tree Problem In Polynomial Time?

Computation theory folklore has it that soap films calculate Steiner trees. If true, this would imply P=NP. However, no rigorous physical experimentation has been performed on the matter. Indeed, such experimentation would be difficult to establish standards for. Furthermore, popular opinion has it that since soap films are classical physics objects [2], this verifies a physical version of the ...